The Possible Irreducibility of Artificial Software Life
نویسنده
چکیده
I argue that the characterisation of reducibility as computability is too weak to be credible. I propose an improved version “intentional computability” and show that it is indeed a stronger criteria, in that there may be specifications for which there exist programs but where there is no systematic way to build such a program from the specification. This undermines the assumption that just because software life would run on a computer that it must be reducible to a computer program as the result of an intentional plan. This, in turn, opens the way to the possibility that an intentionally irreducible program might arise (e.g. by evolution).
منابع مشابه
An Analysis to Wealth Distribution Based on Sugarscape Model in an Artificial Society
In this paper an artificial society is being assumed as a multi agents system. A sugarscape model consisting of a cellular landscape of resources is used to form an interaction among the agents of the population. In the model, agents find the resources to survive. They are supposed to move and search and because of this movement, an evolutionary social behavior will develope. From model analys...
متن کاملIrreducibility of the tensor product of Albeverio's representations of the Braid groups $B_3$ and $B_4$
We consider Albeverio's linear representations of the braid groups $B_3$ and $B_4$. We specialize the indeterminates used in defining these representations to non zero complex numbers. We then consider the tensor products of the representations of $B_3$ and the tensor products of those of $B_4$. We then determine necessary and sufficient conditions that guarantee the irreducibility of th...
متن کاملOn the irreducibility of the complex specialization of the representation of the Hecke algebra of the complex reflection group $G_7$
We consider a 2-dimensional representation of the Hecke algebra $H(G_7, u)$, where $G_7$ is the complex reflection group and $u$ is the set of indeterminates $u = (x_1,x_2,y_1,y_2,y_3,z_1,z_2,z_3)$. After specializing the indetrminates to non zero complex numbers, we then determine a necessary and sufficient condition that guarantees the irreducibility of the complex specialization of the repre...
متن کاملIrreducibility on General Fuzzy Automata
The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.
متن کاملپایش سلامت در حیات مصنوعی در حوزه های بیماری های واگیر و آلودگی
Introductions :Inherent human society and its complexities, in addition the possibility of trial in more social and health sciences, caused using of computerized simulations and artificial models in terms of necessary views that are exist in these types of sciences. to design these artificial models based on real environment and evaluation and recognition and then recalling the results, and usi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999